| Module | Title | LV Type | CP | LV | Dates | Examination |
|---|---|---|---|---|---|---|
| Seminar I Theoretical Computer Science | Aktuelle Themen der Effizienten Algorithmen | Seminar | 4 | 411712 | ||
| Probabilistic Models of Concurrency | Seminar | 4 | 407711 | |||
| Satisfiability Checking | Seminar | 4 | 381530 | Mo 09:00-17:00 t.b.d. (×1) Di 09:00-17:00 t.b.d. (×1) | ||
| Seminar Komplexitätstheorie | Seminar | 4 | 384040 | |||
| Seminar Komplexitätstheorie II | Seminar | 4 | 384041 | |||
| Seminar II Theoretical Computer Science | Aktuelle Themen der Effizienten Algorithmen | Seminar | 4 | 411712 | ||
| Probabilistic Models of Concurrency | Seminar | 4 | 407711 | |||
| Satisfiability Checking | Seminar | 4 | 381530 | Mo 09:00-17:00 t.b.d. (×1) Di 09:00-17:00 t.b.d. (×1) | ||
| Seminar Komplexitätstheorie | Seminar | 4 | 384040 | |||
| Seminar Komplexitätstheorie II | Seminar | 4 | 384041 |